A Lower Bound on the Average Degree Forcing a Minor
نویسندگان
چکیده
منابع مشابه
Average Degree Conditions Forcing a Minor
Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger’s Conjecture, much research has focused on the average degree required to force a complete graph as a minor. Subsequently, various authors have considered the average degree required to force an arbitrary graph H as a minor. Here, we strengthen (under certain conditions) a recent result by R...
متن کاملun 2 01 5 Average degree conditions forcing a minor
Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger’s Conjecture, much research has focused on the average degree required to force a complete graph as a minor. Subsequently, various authors have consider the average degree required to force an arbitrary graphH as a minor. Here, we strengthen (under certain conditions) a recent result by Reed...
متن کاملA better lower bound on average degree of k-list-critical graphs
We improve the best known bounds on average degree of k-list-critical graphs for k ≥ 6. Specifically, for k ≥ 7 we show that every non-complete k-list-critical graph has average degree at least k − 1 + (k−3)(2k−3) k4−2k3−11k2+28k−14 and every non-complete 6-list-critical graph has average degree at least 5 + 93 766 . The same bounds hold for online k-list-critical graphs.
متن کاملA Better Lower Bound on Average Degree of Online k-List-Critical Graphs
We improve the best known bounds on the average degree of online k-list-critical graphs for k > 6. Specifically, for k > 7 we show that every non-complete online k-list-critical graph has average degree at least k−1+ (k−3) 2(2k−3) k4−2k3−11k2+28k−14 and every non-complete online 6-list-critical graph has average degree at least 5 + 93 766 . The same bounds hold for offline k-list-critical graphs.
متن کاملA Better Lower Bound on Average Degree of 4-List-Critical Graphs
This short note proves that every incomplete k-list-critical graph has average degree at least k − 1 + k−3 k2−2k+2 . This improves the best known bound for k = 4, 5, 6. The same bound holds for online k-list-critical graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8847